Unification and Matching Modulo Nilpotence
نویسندگان
چکیده
We consider equational uniication and matching problems where the equational theory contains a nilpotent function, i.e., a function f satisfying f(x;x) = 0 where 0 is a constant. Nilpotent matching and uniication are shown to be NP-complete. In the presence of associativity and commutativity, the problems still remain NP-complete. But when 0 is also assumed to be the unity for the function f, the problems are solvable in polynomial time. We also show that the problem remains in P even when a homomorphism is added. Second-order matching modulo nilpotence is shown to be undecidable.
منابع مشابه
Saturation-Based Theorem Proving: Past Successes and Future Potential (Abstract)
A resolution theorem prover for intuitionistic logic p. 2 Proof-terms for classical and intuitionistic resolution p. 17 Proof-search in intuitionistic logic with equality, or back to simultaneous rigid E-Unification p. 32 Extensions to a generalization critic for inductive proof p. 47 Learning domain knowledge to improve theorem proving p. 62 Patching faulty conjectures p. 77 Internal analogy i...
متن کاملThe Hochschild Cohomology Ring modulo Nilpotence of a Monomial Algebra
For a finite dimensional monomial algebra Λ over a field K we show that the Hochschild cohomology ring of Λ modulo the ideal generated by homogeneous nilpotent elements is a commutative finitely generated Kalgebra of Krull dimension at most one. This was conjectured to be true for any finite dimensional algebra over a field in [13].
متن کاملUnification Modulo Presburger Arithmetic and Other Decidable Theories
We present a general uni cation algorithm modulo Presburger Arithmetic for a restricted class of modularly speci ed theories where function symbols of the target theory have non arithmetic codomain sorts. Additionally, we comment on conditions guaranteeing decidability of matching and uni cation problems modulo more general theories than the arithmetic ones, which appear when automated deductio...
متن کاملOn the Unification Problem for Cartesian Closed Categories
Cartesian closed categories (CCC’s) have played and continue to play an important role in the study of the semantics of programming languages. An axiomatization of the isomorphisms which hold in all Cartesian closed categories discovered independently by Soloviev and Bruce and Longo leads to seven equalities. We show that the unification problem for this theory is undecidable, thus settling an ...
متن کاملHochschild Cohomology and Support Varieties for Tame Hecke Algebras
We give a basis for the Hochschild cohomology ring of tame Hecke algebras. We then show that the Hochschild cohomology ring modulo nilpotence is a finitely generated algebra of Krull dimension 2, and describe the support varieties of modules for these algebras.
متن کامل